Synthesis of bounded Petri Nets from Prime Event Structures with Cutting Context

In this paper we present token flow based synthesis of bounded Petri nets from labelled prime event structures (LPES) associated with a cutting context. For this purpose we use unfolding semantics based on token flows. Given an infinite LPES represented by some finite prefix equipped with a cutting context and cut-off events it is shown how to synthesize a bounded Petri net, such that the unfolding of the synthesized net preserves common prefixes and concurrency of runs of the LPES. The partial language of this unfolding is the minimal partial language of an unfolding of a Petri net, which includes the partial language of the LPES. This result extends the class of non-sequential behaviour, for which Petri nets can be synthesized, because finite representations of infinite LPES by a finite prefix equipped with a cutting context and cut-off events are more expressive than finite representations of infinite partial languages by terms.